Fast linear algebra is stable
نویسندگان
چکیده
منابع مشابه
Fast linear algebra is stable
In [23] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be done by any algorithm in O(n) operations for any η > 0, then it can be done stably in O(n) operations for any η > 0. Here we extend this result to show that essentially all standard linear algebra operations, includin...
متن کاملFast Label Embeddings via Randomized Linear Algebra
Many modern multiclass and multilabel problems are characterized by increasingly large output spaces. For these problems, label embeddings have been shown to be a useful primitive that can improve computational and statistical efficiency. In this work we utilize a correspondence between rank constrained estimation and low dimensional label embeddings that uncovers a fast label embedding algorit...
متن کاملBases for Fast Numerical Linear Algebra
The fundamental ideas of wavelets are introduced within the context of mathematical physics. We present essential background notions of mathematical bases, and discuss Fourier, polynomial, and wavelets bases in this light. We construct several types of wavelets and wavelet-like bases and illustrate their use in algorithms for the solution of a variety of integral and di erential equations.
متن کاملFast Algorithms for Linear Algebra Modulo N
Many linear algebra problems over the ring ZZN of integers modulo N can be solved by transforming via elementary row operations an n ⇥ m input matrix A to Howell form H. The nonzero rows of H give a canonical set of generators for the submodule of (ZZN ) m generated by the rows of A. In this paper we present an algorithm to recover H together with an invertible transformation matrix P which sat...
متن کاملSequential Communication Bounds for Fast Linear Algebra
In this note we obtain communication cost lower and upper bounds on the algorithms for LU and QR given in (Demmel, Dumitriu, and Holtz 2007). The algorithms there use fast, stable matrix multiplication as a subroutine and are shown to be as stable and as computationally efficient as the matrix multiplication subroutine. We show here that they are also as communication-efficient (in the sequenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2007
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-007-0114-x